TWO NEW EFFICIENT APPROXIMATION ALGORITHMS WITH O(k log k) FOR THE STEINER TREE PROBLEM IN RECTILINEAR GRAPHS
نویسندگان
چکیده
Two new approximate algorithms with O ( k l o g k ) for the rectilenear Steiner tree are proposed. Both algorithms base upon the method which makes minimum spanning tree on the modified Delaunay net with the triangular Steiner points as the more virtual generating points, because each point and each edge weight on the modified Delaunay net have been fixed.
منابع مشابه
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
The classical Steiner tree problem requires a shortest tree spanning a given vertex subset within a graph G = (V, E). An important variant is the Steiner tree problem in rectilinear metric. Only recently two algorithms were found which achieve better approximations than the “traditional” one with a factor of 3/2. These algorithms with an approximation ratio of 11/8 are quite slow and run in tim...
متن کاملTwo-level rectilinear Steiner trees
Given a set P of terminals in the plane and a partition of P into k subsets P1, . . . , Pk, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree Ti connecting the terminals in each set Pi (i = 1, . . . , k) and a top-level tree Ttop connecting the trees T1, . . . , Tk. The goal is to minimize the total length of all trees. This problem arises naturally in the design of lo...
متن کامل1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
The Steiner tree problem requires to nd a shortest tree connecting a given set of terminal points in a metric space. We suggest a better and fast heuristic for the Steiner problem in graphs and in rectilinear plane. This heuristic nds a Steiner tree at most 1.757 and 1.267 times longer than the optimal solution in graphs and rectilinear plane, respectively.
متن کاملImproved Steiner Tree Algorithms for Bounded Treewidth
We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in O(B tw+2 · tw · |V |) time, where tw is the graph’s treewidth and the Bell number Bk is the number of partitions of a k-element set. This is a linear time algorithm for graphs with fixed treewidth and a polynomial algorithm for tw = O(log |V |/ log log |V |). While being faster than the ...
متن کاملApproximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
The novel octilinear routing paradigm (X-architecture) in VLSI design requires new approaches for the construction of Steiner trees. In this paper, we consider two versions of the shortest octilinear Steiner tree problem for a given point set K of terminals in the plane: (1) a version in the presence of hard octilinear obstacles, and (2) a version with rectangular soft obstacles. The interior o...
متن کامل